منابع مشابه
The optimal pace of product updates
Some firms (such as Intel and Medtronics) use a time–pacing strategy for new product development, introducing new generations at regular intervals. If the firm adopts a fast pace (introducing frequently) then it prematurely cannibalizes its old generation and incurs high development costs, while if it waits too long, it fails to capitalize on customer willingness–to– pay for more advanced techn...
متن کاملInstitutional Inertia and the Optimal Pace of Market Reforms∗
In this paper, we study the impact of institutional inertia on the implementation of market-oriented reform programs. We examine the problem of a government who can introduce efficiency-enhancing reforms to increase the rate of economic growth by inducing, via monetary compensations, low productivity workers to exit the sector. In our baseline scenario without institutional inertia, efficiency ...
متن کاملOptimal Updates and Convergence Guarantees
Many applications in signal processing benefit from the sparsity of signals in a certain transform domain or dictionary. Synthesis sparsifying dictionaries that are directly adapted to data have been popular in applications such as image denoising, inpainting, and medical image reconstruction. In this work, we focus instead on the sparsifying transform model, and study the learning of well-cond...
متن کاملPACE Optimal Formula and Supporting Proofs
This supplemental material presents proofs for the mathematical claims in the paper, “PACE: A New Approach to Dynamic Voltage Scaling.” In §2, we describe the model of the processor we will use in our theorems and their proofs. We also demonstrate the existence, given this model, of a function S with certain interesting properties. This function will later play an important role in the computat...
متن کاملAge-Optimal Updates of Multiple Information Flows
In this paper, we study an age of information minimization problem, where multiple flows of update packets are sent over multiple servers to their destinations. Two online scheduling policies are proposed. When the packet generation and arrival times are synchronized across the flows, the proposed policies are shown to be (near) optimal for minimizing any timedependent, symmetric, and non-decre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2005
ISSN: 1556-5068
DOI: 10.2139/ssrn.902897